A Simple Denotational Semantics, Proof Theory and a Validation Condition Generator for Unit-Delay VHDL

نویسندگان

  • Peter T. Breuer
  • Luis Sánchez Fernández
  • Carlos Delgado Kloos
چکیده

A denotational semantics and a Hoare programming logic for a subset of the standard hardware description language vhdl are set out here. Both define the behaviour of synchronously clocked vhdl simulators in declarative and compositional style. The logic is proved complete with respect to the denotational semantics and a natural implementation of the logic in prolog as a validation condition generator for vhdl is also described. The subset of the language referred to above essentially consists of elaborated vhdl excluding only delta-delayed signal assignments and zero waits. However, for brevity, only one of the two forms of vhdl signal assignment is treated here. Moreover, for simplicity, signal resolution functions and local state are assumed to have been encoded away via expressions and signals.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving Hardware Designs

Vhdl is a standardized hardware description language with almost universal market penetration. Originally developed in the 1980s with the support of the US DoD, several formalizations of its hardware simulation semantics have appeared in the last few years, including operational semantics in higher order logic and translations to Petri Nets and finite state machines. But in recent work [1] we h...

متن کامل

IFM2005 Doctoral Symposium on Integrated Formal Methods

Current mechanizations of programming logics are often in the form of verification condition generators. These frontends to a prover translate a program and assertions into conditions that when proven state that the program fulfils its assertions. Traditional verification condition generators are monolithic encapsulations of a programming language’s semantics. This makes it hard to build such v...

متن کامل

Theorem proving support in programming language semantics

We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation. Descriptions as recursive functions are also provided whenever suitable, thus yielding a a verifica...

متن کامل

Theorem Proving Support in Programming Language Semantics N° ???? Theorem Proving Support in Programming Language Semantics

We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation. Descriptions as recursive functions are also provided whenever suitable, thus yielding a a verifica...

متن کامل

Approaching the Denotational Semantics of Behavioral VHDL Descriptions

In this paper, we present a framework for de ning the formal semantics of behavioral VHDL92 descriptions. We propose a complementary application of denotational and operational semantics. The static semantics is de ned by denotational means. The de nition of the dynamic semantics is based on an operational model using Interval Event Structures.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Formal Methods in System Design

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1995